Macmahon’s Partition Analysis Xi: Hexagonal Plane Partitions
نویسندگان
چکیده
In this paper we continue the partition explorations made possible by Omega, the computer algebra implementation of MacMahon’s Partition Analysis. The focus of our work has been partitions associated with directed graphs. The graphs considered here are made up of chains of hexagons, and the related generating functions are infinite products. Somewhat unexpectedly, while the generating functions are infinite products, they are most emphatically not modular forms.
منابع مشابه
Macmahon’s Partition Analysis Xii: Plane Partitions
MacMahon developed partition analysis as a calculational and analytic method to produce the generating function for plane partitions. His efforts did not turn out as he had hoped, and he had to spend nearly twenty years finding an alternative treatment. This paper provides a detailed account of our retrieval of MacMahon’s original project. One of the key results obtained with partition analysis...
متن کاملA Generalization of Macmahon’s Formula
We generalize the generating formula for plane partitions known as MacMahon’s formula as well as its analog for strict plane partitions. We give a 2-parameter generalization of these formulas related to Macdonald’s symmetric functions. The formula is especially simple in the Hall-Littlewood case. We also give a bijective proof of the analog of MacMahon’s formula for strict plane partitions.
متن کاملElementary Proof of MacMahon’s Conjecture
Major Percy A. MacMahon’s first paper on plane partitions [4] included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the machinery of basic hypergeometric series [1] and Macdonald employing his knowledge of symmetric functions [3]. The purpose of this paper is to simplify Macd...
متن کاملMACMAHON’S PARTITION ANALYSIS IX: k-GON PARTITIONS
MacMahon devoted a significant portion of Volume II of his famous book “Combinatory Analysis” to the introduction of Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. In a series of papers we have shown that MacMahon’s method turns into an extremely powerful tool when implemented in comput...
متن کاملEnumeration of M-partitions
An M-partition of a positive integer m is a partition of m with as few parts as possible such that every positive integer less than m can be written as a sum of parts taken from the partition. This type of partition is a variation of MacMahon’s perfect partition, and was recently introduced and studied by O’Shea, who showed that for half the numbers m, the number of M-partitions of m is equal t...
متن کامل